#define _CRT_SECURE_NO_WARNINGS 1

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        if (nums[nums.size() - 1] < target) return nums.size();
        int left = 0, right = nums.size() - 1;
        while (left < right)
        {
            int mid = left + (right - left) / 2;
            if (nums[mid] < target)  left = mid + 1;
            else right = mid;
        }
        return left;
    }
};